Application-Oriented Synchronizations
نویسنده
چکیده
In this paper we introduce a formalism which allows to address the speciication of application-oriented synchronizations. The idea behind using synchro-nizations is to force explicit dependences in such a way that the return value for each read operation is more predictable. By using those operations at the application level, programmers are able to obtain ee-cient algorithms for speciic applications. Because of the application-oriented nature of those operations, they do not introduce a big overhead on the complexity of algorithms, allowing enough exibility to take advantage of the programs' behavior.
منابع مشابه
Application of an Object - Oriented Parallel Run - Time
We have taken a Grand Challenge 3d Multi-Grid code, QGMG, initially developed on the Cray C-90 and subsequently parallelized for MPPs, and implemented it using the Dude object-oriented, runtime system which combines both task and data parallelism. The QGMG code is a challenging application for two reasons. Firstly, as in all multigrid solvers, the most straightforward implementation requires th...
متن کاملAd Hoc Synchronization Considered Harmful
Many synchronizations in existing multi-threaded programs are implemented in an ad hoc way. The first part of this paper does a comprehensive characteristic study of ad hoc synchronizations in concurrent programs. By studying 229 ad hoc synchronizations in 12 programs of various types (server, desktop and scientific), including Apache, MySQL, Mozilla, etc., we find several interesting and perha...
متن کاملApplication of an 0 b ject - Orient ed Parallel Run - Time System to a Grand Challenge 3 d Multi - Grid code
We have taken a Grand Challenge 3d Multi-Grid code, QGMG, initially developed on the Cray C-90 and subsequently parallelized for MPPs, and implemented it using the DUDE object-oriented, runtime system which combines both task and data parallelism. The QGMG code is a challenging application for two reasons. Firstly, as in all multigrid solvers, the morrt straightforward implementation requires t...
متن کاملRelaxed Synchronization and Eager Scheduling in MapReduce
MapReduce has emerged as a commonly-used programming model for large-scale distributed environments. While the underlying programming model based on maps and reductions has been shown to be effective in specific domains, significant questions relating to performance and application scope remain unresolved. This paper targets key questions of performance through relaxed semantics of underlying m...
متن کاملResynchronization for Multiprocessor DSP Systems
This paper introduces a technique, called resynchronization, for reducing synchronization overhead in multiprocessor implementations of digital signal processing (DSP) systems. The technique applies to arbitrary collections of dedicated, programmable or configurable processors, such as combinations of programmable DSP’s, ASICS, and FPGA subsystems. Thus, it is particularly well-suited to the ev...
متن کامل